0.12/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.14	% Command    : run_E %s %d THM
0.14/0.36	% Computer : n024.cluster.edu
0.14/0.36	% Model    : x86_64 x86_64
0.14/0.36	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.36	% Memory   : 8042.1875MB
0.14/0.36	% OS       : Linux 3.10.0-693.el7.x86_64
0.14/0.36	% CPULimit   : 960
0.14/0.36	% WCLimit    : 120
0.14/0.36	% DateTime   : Tue Aug  9 03:41:22 EDT 2022
0.14/0.36	% CPUTime    : 
0.20/0.50	Running higher-order on 8 cores theorem proving
0.20/0.50	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.20/0.50	# Version: 3.0pre003-ho
0.20/0.51	# Preprocessing class: HSMSSMSSMLMNHHN.
0.20/0.51	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.51	# Starting ehoh_best2_full_lfho with 600s (5) cores
0.20/0.51	# Starting lpo9_lambda_fix with 120s (1) cores
0.20/0.51	# Starting sh5l with 120s (1) cores
0.20/0.51	# Starting ho_unfolding_6 with 120s (1) cores
0.20/0.51	# lpo9_lambda_fix with pid 25203 completed with status 0
0.20/0.51	# Result found by lpo9_lambda_fix
0.20/0.51	# Preprocessing class: HSMSSMSSMLMNHHN.
0.20/0.51	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.51	# Starting ehoh_best2_full_lfho with 600s (5) cores
0.20/0.51	# Starting lpo9_lambda_fix with 120s (1) cores
0.20/0.51	# SinE strategy is gf500_gu_R04_F100_L20000
0.20/0.51	# ...ProofStateSinE()=14/64
0.20/0.51	# Search class: HGUNF-FFSF22-SHHSMSBN
0.20/0.51	# partial match(1): HGUNF-FFSF22-SHHSMMBN
0.20/0.51	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.20/0.51	# Starting new_ho_10 with 65s (1) cores
0.20/0.51	# new_ho_10 with pid 25207 completed with status 0
0.20/0.51	# Result found by new_ho_10
0.20/0.51	# Preprocessing class: HSMSSMSSMLMNHHN.
0.20/0.51	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.51	# Starting ehoh_best2_full_lfho with 600s (5) cores
0.20/0.51	# Starting lpo9_lambda_fix with 120s (1) cores
0.20/0.51	# SinE strategy is gf500_gu_R04_F100_L20000
0.20/0.51	# ...ProofStateSinE()=14/64
0.20/0.51	# Search class: HGUNF-FFSF22-SHHSMSBN
0.20/0.51	# partial match(1): HGUNF-FFSF22-SHHSMMBN
0.20/0.51	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.20/0.51	# Starting new_ho_10 with 65s (1) cores
0.20/0.51	# Preprocessing time       : 0.001 s
0.20/0.51	# Presaturation interreduction done
0.20/0.51	
0.20/0.51	# Proof found!
0.20/0.51	# SZS status Theorem
0.20/0.51	# SZS output start CNFRefutation
0.20/0.51	thf(decl_22, type, meq_ind: mu > mu > $i > $o).
0.20/0.51	thf(decl_23, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
0.20/0.51	thf(decl_24, type, mnot: ($i > $o) > $i > $o).
0.20/0.51	thf(decl_25, type, mor: ($i > $o) > ($i > $o) > $i > $o).
0.20/0.51	thf(decl_26, type, mand: ($i > $o) > ($i > $o) > $i > $o).
0.20/0.51	thf(decl_27, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
0.20/0.51	thf(decl_28, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
0.20/0.51	thf(decl_29, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
0.20/0.51	thf(decl_30, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
0.20/0.51	thf(decl_31, type, mforall_ind: (mu > $i > $o) > $i > $o).
0.20/0.51	thf(decl_32, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
0.20/0.51	thf(decl_33, type, mexists_ind: (mu > $i > $o) > $i > $o).
0.20/0.51	thf(decl_34, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
0.20/0.51	thf(decl_35, type, mtrue: $i > $o).
0.20/0.51	thf(decl_36, type, mfalse: $i > $o).
0.20/0.51	thf(decl_37, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
0.20/0.51	thf(decl_38, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
0.20/0.51	thf(decl_39, type, mreflexive: ($i > $i > $o) > $o).
0.20/0.51	thf(decl_40, type, msymmetric: ($i > $i > $o) > $o).
0.20/0.51	thf(decl_41, type, mserial: ($i > $i > $o) > $o).
0.20/0.51	thf(decl_42, type, mtransitive: ($i > $i > $o) > $o).
0.20/0.51	thf(decl_43, type, meuclidean: ($i > $i > $o) > $o).
0.20/0.51	thf(decl_44, type, mpartially_functional: ($i > $i > $o) > $o).
0.20/0.51	thf(decl_45, type, mfunctional: ($i > $i > $o) > $o).
0.20/0.51	thf(decl_46, type, mweakly_dense: ($i > $i > $o) > $o).
0.20/0.51	thf(decl_47, type, mweakly_connected: ($i > $i > $o) > $o).
0.20/0.51	thf(decl_48, type, mweakly_directed: ($i > $i > $o) > $o).
0.20/0.51	thf(decl_49, type, mvalid: ($i > $o) > $o).
0.20/0.51	thf(decl_50, type, minvalid: ($i > $o) > $o).
0.20/0.51	thf(decl_51, type, msatisfiable: ($i > $o) > $o).
0.20/0.51	thf(decl_52, type, mcountersatisfiable: ($i > $o) > $o).
0.20/0.51	thf(decl_53, type, epred1_0: $i > $i > $o).
0.20/0.51	thf(decl_54, type, esk1_2: $i > ($i > $o) > $i).
0.20/0.51	thf(decl_55, type, esk2_0: $i).
0.20/0.51	thf(decl_56, type, esk3_0: $i).
0.20/0.51	thf(decl_57, type, esk4_0: $i).
0.20/0.51	thf(mimplies, axiom, ((mimplies)=(^[X6:$i > $o, X7:$i > $o]:(mor @ (mnot @ X6) @ X7))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mimplies)).
0.20/0.51	thf(mnot, axiom, ((mnot)=(^[X6:$i > $o, X3:$i]:(~((X6 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mnot)).
0.20/0.51	thf(mor, axiom, ((mor)=(^[X6:$i > $o, X7:$i > $o, X3:$i]:(((X6 @ X3)|(X7 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mor)).
0.20/0.51	thf(mtransitive, axiom, ((mtransitive)=(^[X13:$i > $i > $o]:(![X15:$i, X16:$i, X17:$i]:((((X13 @ X15 @ X16)&(X13 @ X16 @ X17))=>(X13 @ X15 @ X17)))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mtransitive)).
0.20/0.51	thf(mbox, axiom, ((mbox)=(^[X13:$i > $i > $o, X6:$i > $o, X3:$i]:(![X14:$i]:((~((X13 @ X3 @ X14))|(X6 @ X14)))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mbox)).
0.20/0.51	thf(mforall_prop, axiom, ((mforall_prop)=(^[X9:($i > $o) > $i > $o, X3:$i]:(![X10:$i > $o]:((X9 @ X10 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mforall_prop)).
0.20/0.51	thf(mvalid, axiom, ((mvalid)=(^[X6:$i > $o]:(![X3:$i]:((X6 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mvalid)).
0.20/0.51	thf(conj, conjecture, ![X13:$i > $i > $o]:(((mvalid @ (mforall_prop @ (^[X18:$i > $o]:(mimplies @ (mbox @ X13 @ X18) @ (mbox @ X13 @ (mbox @ X13 @ X18))))))=>(mtransitive @ X13))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj)).
0.20/0.51	thf(c_0_8, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies])).
0.20/0.51	thf(c_0_9, plain, ((mnot)=(^[Z0:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])).
0.20/0.51	thf(c_0_10, plain, ((mor)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor])).
0.20/0.51	thf(c_0_11, plain, ((mtransitive)=(^[Z0:$i > $i > $o]:(![X15:$i, X16:$i, X17:$i]:((((Z0 @ X15 @ X16)&(Z0 @ X16 @ X17))=>(Z0 @ X15 @ X17)))))), inference(fof_simplification,[status(thm)],[mtransitive])).
0.20/0.51	thf(c_0_12, plain, ((mbox)=(^[Z0:$i > $i > $o, Z1:$i > $o, Z2:$i]:(![X14:$i]:((~((Z0 @ Z2 @ X14))|(Z1 @ X14)))))), inference(fof_simplification,[status(thm)],[mbox])).
0.20/0.51	thf(c_0_13, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_8, c_0_9]), c_0_10])).
0.20/0.51	thf(c_0_14, plain, ((mforall_prop)=(^[Z0:($i > $o) > $i > $o, Z1:$i]:(![X10:$i > $o]:((Z0 @ X10 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_prop])).
0.20/0.51	thf(c_0_15, plain, ((mvalid)=(^[Z0:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])).
0.20/0.51	thf(c_0_16, negated_conjecture, ~(![X13:$i > $i > $o]:((![X26:$i, X25:$i > $o]:((~(![X22:$i]:((~(X13 @ X26 @ X22)|(X25 @ X22))))|![X24:$i]:((~(X13 @ X26 @ X24)|![X23:$i]:((~(X13 @ X24 @ X23)|(X25 @ X23)))))))=>![X27:$i, X28:$i, X29:$i]:((((X13 @ X27 @ X28)&(X13 @ X28 @ X29))=>(X13 @ X27 @ X29)))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]), c_0_11]), c_0_12]), c_0_13]), c_0_14]), c_0_15])])).
0.20/0.51	thf(c_0_17, negated_conjecture, ![X31:$i, X32:$i > $o, X34:$i, X35:$i]:(((((epred1_0 @ X31 @ (esk1_2 @ X31 @ X32))|(~(epred1_0 @ X31 @ X34)|(~(epred1_0 @ X34 @ X35)|(X32 @ X35))))&(~(X32 @ (esk1_2 @ X31 @ X32))|(~(epred1_0 @ X31 @ X34)|(~(epred1_0 @ X34 @ X35)|(X32 @ X35)))))&(((epred1_0 @ esk2_0 @ esk3_0)&(epred1_0 @ esk3_0 @ esk4_0))&~(epred1_0 @ esk2_0 @ esk4_0)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])])])).
0.20/0.51	thf(c_0_18, negated_conjecture, ![X14:$i, X4:$i > $o, X3:$i, X15:$i]:(((X4 @ X15)|~((X4 @ (esk1_2 @ X3 @ X4)))|~((epred1_0 @ X3 @ X14))|~((epred1_0 @ X14 @ X15)))), inference(split_conjunct,[status(thm)],[c_0_17])).
0.20/0.51	thf(c_0_19, negated_conjecture, (epred1_0 @ esk3_0 @ esk4_0), inference(split_conjunct,[status(thm)],[c_0_17])).
0.20/0.51	thf(c_0_20, negated_conjecture, ![X14:$i, X4:$i > $o, X3:$i, X15:$i]:(((epred1_0 @ X3 @ (esk1_2 @ X3 @ X4))|(X4 @ X15)|~((epred1_0 @ X3 @ X14))|~((epred1_0 @ X14 @ X15)))), inference(split_conjunct,[status(thm)],[c_0_17])).
0.20/0.51	thf(c_0_21, negated_conjecture, ![X4:$i > $o, X3:$i]:(((X4 @ esk4_0)|~((X4 @ (esk1_2 @ X3 @ X4)))|~((epred1_0 @ X3 @ esk3_0)))), inference(spm,[status(thm)],[c_0_18, c_0_19])).
0.20/0.51	thf(c_0_22, negated_conjecture, ![X4:$i > $o, X3:$i]:(((epred1_0 @ X3 @ (esk1_2 @ X3 @ X4))|(X4 @ esk4_0)|~((epred1_0 @ X3 @ esk3_0)))), inference(spm,[status(thm)],[c_0_20, c_0_19])).
0.20/0.51	thf(c_0_23, negated_conjecture, ~((epred1_0 @ esk2_0 @ esk4_0)), inference(split_conjunct,[status(thm)],[c_0_17])).
0.20/0.51	thf(c_0_24, negated_conjecture, ![X3:$i]:(((epred1_0 @ X3 @ esk4_0)|~((epred1_0 @ X3 @ esk3_0)))), inference(spm,[status(thm)],[c_0_21, c_0_22])).
0.20/0.51	thf(c_0_25, negated_conjecture, (epred1_0 @ esk2_0 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_17])).
0.20/0.51	thf(c_0_26, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_25])]), ['proof']).
0.20/0.51	# SZS output end CNFRefutation
0.20/0.51	# Parsed axioms                        : 64
0.20/0.51	# Removed by relevancy pruning/SinE    : 50
0.20/0.51	# Initial clauses                      : 5
0.20/0.51	# Removed in clause preprocessing      : 0
0.20/0.51	# Initial clauses in saturation        : 5
0.20/0.51	# Processed clauses                    : 14
0.20/0.51	# ...of these trivial                  : 0
0.20/0.51	# ...subsumed                          : 0
0.20/0.51	# ...remaining for further processing  : 14
0.20/0.51	# Other redundant clauses eliminated   : 0
0.20/0.51	# Clauses deleted for lack of memory   : 0
0.20/0.51	# Backward-subsumed                    : 0
0.20/0.51	# Backward-rewritten                   : 0
0.20/0.51	# Generated clauses                    : 11
0.20/0.51	# ...of the previous two non-redundant : 7
0.20/0.51	# ...aggressively subsumed             : 0
0.20/0.51	# Contextual simplify-reflections      : 0
0.20/0.51	# Paramodulations                      : 11
0.20/0.51	# Factorizations                       : 0
0.20/0.51	# NegExts                              : 0
0.20/0.51	# Equation resolutions                 : 0
0.20/0.51	# Propositional unsat checks           : 0
0.20/0.51	#    Propositional check models        : 0
0.20/0.51	#    Propositional check unsatisfiable : 0
0.20/0.51	#    Propositional clauses             : 0
0.20/0.51	#    Propositional clauses after purity: 0
0.20/0.51	#    Propositional unsat core size     : 0
0.20/0.51	#    Propositional preprocessing time  : 0.000
0.20/0.51	#    Propositional encoding time       : 0.000
0.20/0.51	#    Propositional solver time         : 0.000
0.20/0.51	#    Success case prop preproc time    : 0.000
0.20/0.51	#    Success case prop encoding time   : 0.000
0.20/0.51	#    Success case prop solver time     : 0.000
0.20/0.51	# Current number of processed clauses  : 9
0.20/0.51	#    Positive orientable unit clauses  : 2
0.20/0.51	#    Positive unorientable unit clauses: 0
0.20/0.51	#    Negative unit clauses             : 1
0.20/0.51	#    Non-unit-clauses                  : 6
0.20/0.51	# Current number of unprocessed clauses: 3
0.20/0.51	# ...number of literals in the above   : 13
0.20/0.51	# Current number of archived formulas  : 0
0.20/0.51	# Current number of archived clauses   : 5
0.20/0.51	# Clause-clause subsumption calls (NU) : 14
0.20/0.51	# Rec. Clause-clause subsumption calls : 4
0.20/0.51	# Non-unit clause-clause subsumptions  : 0
0.20/0.51	# Unit Clause-clause subsumption calls : 0
0.20/0.51	# Rewrite failures with RHS unbound    : 0
0.20/0.51	# BW rewrite match attempts            : 0
0.20/0.51	# BW rewrite match successes           : 0
0.20/0.51	# Condensation attempts                : 14
0.20/0.51	# Condensation successes               : 0
0.20/0.51	# Termbank termtop insertions          : 1896
0.20/0.51	
0.20/0.51	# -------------------------------------------------
0.20/0.51	# User time                : 0.006 s
0.20/0.51	# System time              : 0.000 s
0.20/0.51	# Total time               : 0.006 s
0.20/0.51	# Maximum resident set size: 1912 pages
0.20/0.51	
0.20/0.51	# -------------------------------------------------
0.20/0.51	# User time                : 0.007 s
0.20/0.51	# System time              : 0.003 s
0.20/0.51	# Total time               : 0.010 s
0.20/0.51	# Maximum resident set size: 1796 pages
0.20/0.51	EOF